Game theory, complexity and simplicity part 1: A tutorial
نویسندگان
چکیده
منابع مشابه
Game theory, complexity and simplicity part 1: A tutorial
SFI WORKING PAPER: 1998-04-027 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...
متن کاملGAME THEORY , COMPLEXITY AND SIMPLICITY Part I : A Tutorial
The theory of games is now over 50 years old. Its applications and misapplications abound. It is now "respectable". Bright young economic theorists bucking for promotion need to be aware of agency theory, reputation theory, the new industrial organization, auction theory, refinements of equilibria, perfect equilibria, trembling hand equilibria, strong equilibria, Bayesian equilibria, problems w...
متن کاملGame theory, complexity, and simplicity Part III: Critique and prospective
SFI WORKING PAPER: 1998-04-029 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...
متن کاملGame theory, complexity, and simplicity part II: Problems and applications
In Part I an expository overview of the basic concepts of the theory of games was presented. The different forms for representing a game were noted and the various solutions were discussed and illustrated. Here we examine the highly different approaches adopted by those who regard themselves as game theorists and by those others who utilize game theory We examine the four most important distinc...
متن کاملComplexity Theory - Tutorial
It is clear that Ñ would accept L (N accepts if one branch ends up in the accepting state. Ñ would notice that as rejecting state it would reject as soon as there is one rejecting state because all the states are universal. N rejects if no branch end in an accepting state, i.e., all end up in the rejecting state. But for Ñ that would mean that all the branches are accepting, therefore, it would...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 1997
ISSN: 1076-2787,1099-0526
DOI: 10.1002/(sici)1099-0526(199711/12)3:2<39::aid-cplx8>3.0.co;2-h